Physically Embedded Genetic Algorithm Learning in Multi-Robot Scenarios: The PEGA algorithm∗

نویسنده

  • Ulrich Nehmzow
چکیده

We present experiments in which a group of autonomous mobile robots learn to perform fundamental sensor-motor tasks through a collaborative learning process. Behavioural strategies, i.e. motor responses to sensory stimuli, are encoded by means of genetic strings stored on the individual robots, and adapted through a genetic algorithm (Mitchell, 1998) executed by the entire robot collective: robots communicate their own strings and corresponding fitness to each other, and then execute a genetic algorithm to improve their individual behavioural strategy. The robots acquired three different sensormotor competences, as well as the ability to select one of two, or one of three behaviours depending on context (“behaviour management”). Results show that fitness indeed increases with increasing learning time, and the analysis of the acquired behavioural strategies demonstrates that they are effective in accomplishing the desired task.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning in Multi-Robot Scenarios through Physically Embedded Genetic Algorithms∗

Motivation. For certain applications of autonomous mobile robots — surveillance, cleaning or exploration come immediately to mind — it is attractive to employ several robots simultaneously. Tasks such as the ones mentioned above are easily divisible between independent robots, and using several robots simultaneously promises a speedup of task execution, as well as more reliable and robust perfo...

متن کامل

GA Learning in Multi-Robot Scenarios: The PEGA algorithm

We present experiments in which a group of autonomous mobile robots learn to perform fundamental sensor-motor tasks through a collaborative learning process. Behavioural strategies (i.e. motor responses to sensory stimuli) are encoded by means of genetic strings stored on the individual robots, and adapted through a genetic algorithm executed by the entire robot collective: robots communicate t...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Trajectory Tracking of a Mobile Robot Using Fuzzy Logic Tuned by Genetic Algorithm (TECHNICAL NOTE)

In recent years, soft computing methods, like fuzzy logic and neural networks have been  presented and developed for the purpose of mobile robot trajectory tracking. In this paper we will present a fuzzy approach to the problem of mobile robot path tracking for the CEDRA rescue robot with a complicated kinematical model. After designing the fuzzy tracking controller, the membership functions an...

متن کامل

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002